Resource speed limits: maximal rate of resource variation

Resource Limits for Haskell

We describe the first iteration of a resource limits system for Haskell, taking advantage of the key observation that resource limits share semantics and implementation strategy with profiling. We pay special attention to the problem of limiting resident memory usage: we describe a simple implementation technique for carrying out incremental heap censuses and describe a novel informationflow co...

Anesthesia Provider Characterizations and Resource Variation

Equal rate resource allocation for multiuser OFDM

The performance of multicarrier systems can be enhanced by the water filling strategy, in which different rates and powers are allocated to subcarriers. However, the induced large signalling overhead leads to less transmission efficiency. To suppress this effect this article proposes an alternative strategy by dynamically assigning the same rate to each subcarrier per user. First, we quantify t...

Resource marking and fair rate allocation

In resource marking theory, users adapt their rates according to their utility functions and congestion signals from the network. Using a special type of utility functions, this will lead to a proportionally fair rate allocation among the users. In this paper, we examine the ability of two proposed resource marking implementations to yield a proportionally fair rate allocation. We also propose ...

Fundamental Limits of Input Rate Contol in High Speed Networks

I n this paper‘ we explore the fundamental limits of input mte control by spectral analysis in frequency domain. Both deterministic and stochastic analyses are developed. Especially, the simple deterministic analysis helps us to gain a great knowledge of performance trade-off for input rate control in high speed network.